Scalable, Trie-based Approximate Entity Extraction for Real-Time Financial Transaction Screening
نویسنده
چکیده
Financial institutions have to screen their transactions to ensure that they are not affiliated with terrorism entities. Developing appropriate solutions to detect such affiliations precisely while avoiding any kind of interruption to large amount of legitimate transactions is essential. In this paper, we present building blocks of a scalable solution that may help financial institutions to build their own software to extract terrorism entities out of both structured and unstructured financial messages in real time and with approximate similarity matching approach.
منابع مشابه
Summary Structures for Frequency Queries on Large Transaction Sets
As large-scale databases become commonplace, there has been signi cant interest in mining them for commercial purposes. One of the basic tasks that underlies many of these mining operations is querying of transaction sets for frequencies of speci ed attribute values. The size of these databases makes it important to develop summary structures capable of high compression ratios as well as suppor...
متن کاملMeDIP Real-Time qPCR has the Potential for Noninvasive Prenatal Screening of Fetal Trisomy 21
This study aimed to verify the reliability of the 7 tissue differentially methylated regions used in the methylated DNA immunoprecipitation (MeDIP) real-time quantitative polymerase chain reaction (real-time qPCR) based approach of fetal DNA in maternal blood to diagnosis of fetal trisomy 21. Forty pregnant women with high risk pregnancy who were referred after first or second trimester screeni...
متن کاملTowards a Scalable and Robust Entity Resolution -Approximate Blocking with Semantic Constraints
Entity resolution, or record linkage, is the process that identifies data records over one or more datasets which refer to the same real world entity. To deal with large datasets, many real-life applications require scalable and high-quality entity resolution techniques. Blocking techniques can help to scale-up the entity resolution process. Locality sensitive hashing (LSH) is an approximate bl...
متن کاملAdaptive Approximate Record Matching
Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...
متن کاملTH*:Scalable Distributed Trie Hashing
In today’s world of computers, dealing with huge amounts of data is not unusual. The need to distribute this data in order to increase its availability and increase the performance of accessing it is more urgent than ever. For these reasons it is necessary to develop scalable distributed data structures. In this paper we propose a TH* distributed variant of the Trie Hashing data structure. Firs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1701.03492 شماره
صفحات -
تاریخ انتشار 2017